Quasi-Possibilistic Logic and its Measures of Information and Conflict

نویسندگان

  • Didier Dubois
  • Sébastien Konieczny
  • Henri Prade
چکیده

Possibilistic logic and quasi-classical logic are two logics that were developed in artificial intelligence for coping with inconsistency in different ways, yet preserving the main features of classical logic. This paper presents a new logic, called quasi-possibilistic logic, that encompasses possibilistic logic and quasi-classical logic, and preserves the merits of both logics. Indeed, it can handle plain conflicts taking place at the same level of certainty (as in quasi-classical logic), and take advantage of the stratification of the knowledge base into certainty layers for introducing gradedness in conflict analysis (as in possibilistic logic). When querying knowledge bases, it may be of interest to evaluate the extent to which the relevant available information is precise and consistent. The paper review measures of (im)precision and inconsistency/conflict existing in possibilistic logic and quasi-classical logic, and proposes generalized measures in the unified framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conflict-Based Belief Revision Operators in Possibilistic Logic

In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...

متن کامل

Conflict-Based Belief Revision Operators in Possibilistic Logic

In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...

متن کامل

Formalizing argumentative reasoning in a possibilistic 3 logic programming setting with fuzzy unification q

12 Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from 13 argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-lan14 guage level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot 15 be expressed in the object la...

متن کامل

Interval-Based Possibilistic Logic

Possibilistic logic is a well-known framework for dealing with uncertainty and reasoning under inconsistent knowledge bases. Standard possibilistic logic expressions are propositional logic formulas associated with positive real degrees belonging to [0,1]. However, in practice it may be difficult for an expert to provide exact degrees associated with formulas of a knowledge base. This paper pro...

متن کامل

Reasoning with partially ordered information in a possibilistic logic framework

In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete knowledge. Possibilistic logic, which is an extension of classical logic, deals with totally ordered inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2003